Mininng High Utility Itemsets (HUI) with negative items is one of the emerging itemsets mining tasks. In order to mine the result set of HUI with negative items meeting the user needs, a Top- k High utility itemsets with Negative items (THN) mining algorithm was proposed. In order to improve the temporal and spatial performance of the THN algorithm, a strategy to automatically increase the minimum utility threshold was proposed, and the pattern growth method was used for depth-first search; the search space was pruned by using the redefined subtree utility and the redefined local utility; the transaction merging technology and dataset projection technology were employed to solve the problem of scanning the database for multiple times; in order to increase the utility counting speed, the utility array counting technology was used to calculate the utility of the itemset. Experimental results show that the memory usage of THN algorithm is about 1/60 of that of the HUINIV (High Utility Itemsets with Negative Item Values)-Mine algorithm, and is about 1/2 of that of the FHN (Faster High utility itemset miner with Negative unit profits) algorithm; the THN algorithm takes 1/10 runtime of that of the FHN algorithm; and the THN algorithm achieves better performance on dense datasets.

For the Flexible Job-shop Scheduling Problem (FJSP) with machine flexibility and machine tool depreciation, in order to reduce the energy consumption in the production process, a mathematical model with the minimization of weighted sum of maximum completion time and total energy consumption as the scheduling objective was established, and an Improved Genetic Algorithm (IGA) was proposed. Firstly, according to strong randomness of Genetic Algorithm (GA), the principle of balanced dispersion of orthogonal test was introduced to generate initial population, which was used to improve the search performance in global range. Secondly, in order to overcome genetic conflict after crossover operation, the coding mode of three-dimensional real numbers and the arithmetic crossover of double individuals were used for chromosome crossover, which reduced the steps of conflict detection and improved the solving speed. Finally, the dynamic step length was adopted to perform genetic mutation in mutation operation stage, which guaranteed local search ability in global range. By testing on the 8 Brandimarte examples and comparing with 3 improved heuristic algorithms in recent years, the calculation results show that the proposed algorithm is effective and feasible to solve the FJSP.

To balance load in cryptography cloud systems, a Virtual cipher machine Scheduling Method based on Entropy Weight Evaluation (VSMEWE) was proposed. In order to improve the quality of cryptography service and economize resources of cryptography cloud effectively, a virtual cipher machine migration selection solution was presented, according to the comparison results of comprehensive evaluation values of cloud cipher machine. To achieve the best comprehensive evaluation values, it evaluated the resource states of cloud cipher machine with the main indexes including the utilizations of resources, such as CPU, memory, network bandwidth and throughput bandwidth of cipher card. Finally, a migration selection scheme of virtual cipher machine was decided by the scheduling method. Compared with Entropy algorithm and Baseline algorithm, the experimental results show that the proposed algorithm has characteristics of wholeness and chronergy, the effect of load balancing is improved, and the execution efficiency is increased by 6.8% and 22.7% respectively.

In order to achieve complementary advantages and information sharing of heterogeneous workflow systems among enterprises, concerning the workflow showing heterogeneous distribution and other characteristics, an interface design of heterogeneous workflow processes interconnection based on Web service was proposed. For the interconnection of heterogeneous processes, the solution of heterogeneous workflow interconnection was described from call interface，call mode and call return respectively. Taking example of SynchroFlow workflow process described by XPDL and ODE (Open Dynamic Engine) workflow process described by BPEL, the process calls between the workflows was achieved.

Polysemy is an important and pervasive semantic phenomenon in Chinese; the task of word sense induction is to classify words with the same semantics in different contexts, which is a clustering problem essentially. Currently, unsupervised clustering algorithm has been widely used in its research. In this paper, an improved method of k-means was proposed, which mainly improved the selection of initial cluster centers and the calculation of cluster centroid and overcame the “noise” and the sensitivity of isolated point in data to some extent. Another idea was to use the classification coding of word in Tongyici Cilin to reduce the feature dimension. The experimental results show that the performance has great improvement with the improved k-means, of which the F-Score reached 75.8%.